package LeetCode.LeetCode2;

/**
 * 二叉树的最大深度
 * @author lumin
 * @date 2022/03/17 16:18
 **/
public class Num101 {
    public class TreeNode {
       int val;
       TreeNode left;
       TreeNode right;
       TreeNode() {}
       TreeNode(int val) { this.val = val; }
       TreeNode(int val, TreeNode left, TreeNode right) {
           this.val = val;
           this.left = left;
           this.right = right;
       }
    }
    public boolean isSymmetric(TreeNode root) {
        if(root == null){
            return false;
        }
        return true;
    }
}